Pattern Avoidance in Generalized Non-crossing Trees
نویسندگان
چکیده
Abstract. In this paper, the problem of pattern avoidance in generalized non-crossing trees is studied. The generating functions for generalized non-crossing trees avoiding patterns of length one and two are obtained. Lagrange inversion formula is used to obtain the explicit formulas for some special cases. Bijection is also established between generalized non-crossing trees with special pattern avoidance and the little Schröder paths.
منابع مشابه
String Pattern Avoidance in Generalized Non-crossing Trees
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt età la diffusion de documents scientifiques de niveau r...
متن کاملPattern Avoidance in Labelled Trees
We discuss a new notion of pattern avoidance motivatedby operad theory: pattern avoidance in planar labelled trees. It is a generalisation of various types of consecutive pattern avoidance studied before: consecutive patterns in words, permutations, colouredpermutations, etc. ThenotionofWilf equivalence for patterns in permutations admits a straightforward generalisation for (sets of) tree patt...
متن کاملNon-Contiguous Pattern Avoidance in Binary Trees
In this paper we consider the enumeration of binary trees avoiding non-contiguous binary tree patterns. We begin by computing closed formulas for the number of trees avoiding a single binary tree pattern with 4 or fewer leaves and compare these results to analogous work for contiguous tree patterns. Next, we give an explicit generating function that counts binary trees avoiding a single non-con...
متن کاملGeneralized Pattern Avoidance with Additional Restrictions
Babson and Steingŕımsson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We consider n-permutations that avoid the generalized pattern 1-32 and whose k rightmost letters form an increasing subword. The number of such permutations is a linear combination of Bell numbers. We find a bijection between...
متن کاملNon-Crossing Partitions in Binary, Ordered and Motzkin Trees
Non-Crossing Tree partitions are newer mathematical objects that have recent applications in genetics and mathematical biology. We explore several interesting connections between these partitions and the more commonly studied non-crossing set partitions. While non-crossing set partitions are counted by the Catalan numbers, we prove that non-crossing tree partitions in Binary trees are counted b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008